Deconstructing Queue-Based Mutual Exclusion
نویسنده
چکیده
Deconstructing Queue-Based Mutual Exclusion
منابع مشابه
An O(vn) Distributed Mutual Exclusion Algorithm Using Queue Migration
In this paper a distributed algorithm is proposed that realises mutual exclusion among n nodes in a computer network. There is no common or global memory shared by the nodes and there is no global controller. The nodes of the network communicate among themselves by exchanging messages only. The proposed algorithm is based on queue migration and achieves a message complexity of O(√n) per mutual ...
متن کاملA Fault-Tolerant Token-Based Mutual Exclusion Algorithm Using a Dynamic Tree
This article presents a fault tolerant extension for the NaimiTrehel token-based mutual exclusion algorithm. Contrary to the extension proposed by Naimi-Trehel, our approach minimizes the use of broadcast support by exploiting the distributed queue of token requests kept by the original algorithm. It also provides good fairness since, during failure recovery, it tries to preserve the order in w...
متن کاملA New Approach to Mutual Exclusion for Tackling Selfish Nodes in a Distributed Spectrum
In distributed systems, it is difficult to predict whether the node is genuine or not and this may lead to the addition of selfish/ malicious nodes. The selfish/malicious nodes are the nodes that continue the execution of their codes for unknown/prolonged duration. For allotting the nodes with resources, the mutual exclusion algorithms, either token based, non-token based quorum-based or agreem...
متن کاملMSL Based Concurrent and Efficient Priority Queue
Priority queues are fundamental in the design of modern multiprocessor algorithms. Priority queues with parallel access are an attractive data structure for applications like prioritized online scheduling, discrete event simulation, or branch-and-bound. This paper proposes an alternative approach: to base the design of concurrent priority queues on the Modified Skip List data structure. To this...
متن کاملMultiprocess Time Queue
We show how to implement a bounded time queue for two different processes. The time queue is a variant of a priority queue with elements from a discrete universe. The bounded time queue has elements from a discrete bounded universe. One process has time constraints and may only spend constant worst case time on each operation while the other process may spend more time. The time constrained pro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1310.7397 شماره
صفحات -
تاریخ انتشار 2012